for _ in range(int(input())):
n = int(input())
k = 0
k += (((n//2)-2)//3)*3 + (((n//2)-2) - ((n//2)-2)//3) + 4 + (n//2 - n//6)*3 + (n//6)*5
if n%2 != 0 :
if n%3 == 0:
k+= 3
else: k+=1
print(k)
#include<bits/stdc++.h>
#define int long long
using namespace std;
inline void solve() {
int n;
scanf("%lld",&n);
printf("%lld\n",n+(n/2+n/3)*2);
return ;
}
signed main() {
int T;
scanf("%lld",&T);
while(T--) solve();
return 0;
} 550B - Preparing Olympiad | 939B - Hamster Farm |
732A - Buy a Shovel | 1220C - Substring Game in the Lesson |
452A - Eevee | 1647B - Madoka and the Elegant Gift |
1408A - Circle Coloring | 766B - Mahmoud and a Triangle |
1618C - Paint the Array | 469A - I Wanna Be the Guy |
1294A - Collecting Coins | 1227A - Math Problem |
349A - Cinema Line | 47A - Triangular numbers |
1516B - AGAGA XOOORRR | 1515A - Phoenix and Gold |
1515B - Phoenix and Puzzle | 155A - I_love_username |
49A - Sleuth | 1541A - Pretty Permutations |
1632C - Strange Test | 673A - Bear and Game |
276A - Lunch Rush | 1205A - Almost Equal |
1020B - Badge | 1353A - Most Unstable Array |
770A - New Password | 1646B - Quality vs Quantity |
80A - Panoramix's Prediction | 1354B - Ternary String |